Top-k Ranking Bayesian Optimization

نویسندگان

چکیده

This paper presents a novel approach to top-k ranking Bayesian optimization (top-k BO) which is practical and significant generalization of preferential BO handle tie/indifference observations. We first design surrogate model that not only capable catering the above observations, but also supported by classic random utility model. Another equally important contribution introduction information-theoretic acquisition function in with observation called multinomial predictive entropy search (MPES) flexible handling these observations optimized for all inputs query jointly. MPES possesses superior performance compared existing functions select one at time greedily. empirically evaluate using several synthetic benchmark functions, CIFAR-10 dataset, SUSHI preference dataset.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Consistency of Top-k Ranking

This paper is concerned with the consistency analysis on listwise ranking methods. Among various ranking methods, the listwise methods have competitive performances on benchmark datasets and are regarded as one of the state-of-the-art approaches. Most listwise ranking methods manage to optimize ranking on the whole list (permutation) of objects, however, in practical applications such as inform...

متن کامل

Ranking Objects by Exploiting Relationships: Computing Top-K over Aggregation

In many document collections, documents are related to objects such as document authors, products described in the document, or persons referred to in the document. In many applications, the goal is to find such related objects that best match a set of keywords. The keywords may not necessarily occur in the textual descriptions of target objects; they occur only in the documents. In order to an...

متن کامل

Competitive analysis of the top-K ranking problem

Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top K items from noisy pairwise comparisons. In our setting, we are non-actively given r pairwise comparisons between each pair of n items, where each comparison has noise constrained by a very general noise model called the strong stochastic transitiv...

متن کامل

Transductive Optimization of Top k Precision

Consider a binary classification problem in which the learner is given a labeled training set, an unlabeled test set, and is restricted to choosing exactly k test points to output as positive predictions. Problems of this kind—transductive precision@k— arise in many applications. Previous methods solve these problems in two separate steps, learning the model and selecting k test instances by th...

متن کامل

Ranking uncertain sky: The probabilistic top-k skyline operator

Many recent applications involve processing and analyzing uncertain data. In this paper, we combine the feature of top-k objects with that of skyline to model the problem of top-k skyline objects against uncertain data. The problem of efficiently computing top-k skyline objects on large uncertain datasets is challenging in both computing the top-k skyline objects is developed for discrete cases...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i10.17103